Modelling Software Evolution using Algebraic Graph Rewriting
نویسندگان
چکیده
We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the relations in UML interaction diagrams. Then, we provide a set of algebraic graph rewrite rules that formalizes the changes that may be caused by an evolution request, using the pushout construction in the category of marked colored graphs.
منابع مشابه
Consistent Ontologies Evolution Using Graph Grammars
Ontologies are often used for the meta-modelling of dynamic domains, therefore it is essential to represent and manage their changes and to adapt them to new requirements. Due to changes, an ontology may become invalid and non-interpretable. This paper proposes the use of the graph grammars to formalize and manage ontologies evolution. The objective is to present an a priori approach of inconsi...
متن کاملGraph-Based Design and Analysis of Dynamic Software Architectures
We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented in Alloy; ii) a process algebraic presentation of graph transformation implemented in Maude. The two approaches are compared by showing how different aspects can be tackled, including representation issues, modelling p...
متن کاملArchitectural Design Rewriting as an Architecture Description Language
Architectural Design Rewriting (ADR) is a declarative rule-based approach for the design of dynamic software architectures. The key features that make ADR a suitable and expressive framework are the algebraic presentation of graph-based structures and the use of conditional rewrite rules. These features enable the modelling of, e.g. hierarchical design, inductively defined reconfigurations and ...
متن کاملProcess Evolution based on Transformation of Algebraic High-Level Nets with Applications to Communication Platforms
Algebraic High-Level (AHL) nets are a well-known modelling technique based on Petri nets with algebraic data types, which allows to model the communication structure and the data flow within one modelling framework. Transformations of AHL-nets – inspired by the theory of graph transformations – allow in addition to modify the communication structure. Moreover, high-level processes of AHL-nets c...
متن کاملA Graphical Tool Support to Process and Simulate ECATNets Models based on Meta-Modelling and Graph Grammars
ECATNets are an algebraic Petri net category based on a safe combination of algebraic abstract types and high level Petri Nets. ECATNets’ semantic are defined in terms of rewriting logic allowing us to built models by formal reasoning. Furthermore, the rewriting logic language Maude gives to ECATNEts dynamic aspects which are not measurable without simulation. The building of a modelling tool f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006